Boundary maps for C∗C^*-crossed products with R with an application to the quantum Hall effect

The boundary map in K-theory arising from the Wiener-Hopf extension of a crossed product algebra with R is the Connes-Thom isomorphism. In this article the Wiener Hopf extension is combined with the Heisenberg group algebra to provide an elementary construction of a corresponding map on higher traces (and cyclic cohomology). It then follows directly from a non-commutative Stokes theorem that this map is dual w.r.t.Connes' pairing of cyclic cohomology with K-theory. As an application, we prove equality of quantized bulk and edge conductivities for the integer quantum Hall effect described by continuous magnetic Schroedinger operators.Comment: to appear in Commun. Math. Phy

Time-Energy coherent states and adiabatic scattering

Coherent states in the time-energy plane provide a natural basis to study adiabatic scattering. We relate the (diagonal) matrix elements of the scattering matrix in this basis with the frozen on-shell scattering data. We describe an exactly solvable model, and show that the error in the frozen data cannot be estimated by the Wigner time delay alone. We introduce the notion of energy shift, a conjugate of Wigner time delay, and show that for incoming state $\rho(H_0)$ the energy shift determines the outgoing state.Comment: 11 pages, 1 figur

On the maximal ionization of atoms in strong magnetic fields

We give upper bounds for the number of spin 1/2 particles that can be bound to a nucleus of charge Z in the presence of a magnetic field B, including the spin-field coupling. We use Lieb's strategy, which is known to yield N_c<2Z+1 for magnetic fields that go to zero at infinity, ignoring the spin-field interaction. For particles with fermionic statistics in a homogeneous magnetic field our upper bound has an additional term of order $Z\times\min{(B/Z^3)^{2/5},1+|\ln(B/Z^3)|^2}$.Comment: LaTeX2e, 8 page

Adiabatic response for Lindblad dynamics

We study the adiabatic response of open systems governed by Lindblad evolutions. In such systems, there is an ambiguity in the assignment of observables to fluxes (rates) such as velocities and currents. For the appropriate notion of flux, the formulas for the transport coefficients are simple and explicit and are governed by the parallel transport on the manifold of instantaneous stationary states. Among our results we show that the response coefficients of open systems, whose stationary states are projections, is given by the adiabatic curvature.Comment: 33 pages, 4 figures, accepted versio

Roughening transition, surface tension and equilibrium droplet shapes in a two-dimensional Ising system

The exact surface tension for all angles and temperatures is given for the two-dimensional square Ising system with anisotropic nearest-neighbour interactions. Using this in the Wulff construction, droplet shapes are computed and illustrated. Letting temperature approach zero allows explicit study of the roughening transition in this model. Results are compared with those of the solid-on-solid approximation

On Approximating the Number of kk-cliques in Sublinear Time

We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let $n$ denote the number of vertices in the graph, $m$ the number of edges, and $C_k$ the number of $k$-cliques. We design an algorithm that outputs a $(1+\varepsilon)$-approximation (with high probability) for $C_k$, whose expected query complexity and running time are O\left(\frac{n}{C_k^{1/k}}+\frac{m^{k/2}}{C_k}\right)\poly(\log n,1/\varepsilon,k). Hence, the complexity of the algorithm is sublinear in the size of the graph for $C_k = \omega(m^{k/2-1})$. Furthermore, we prove a lower bound showing that the query complexity of our algorithm is essentially optimal (up to the dependence on $\log n$, $1/\varepsilon$ and $k$). The previous results in this vein are by Feige (SICOMP 06) and by Goldreich and Ron (RSA 08) for edge counting ($k=2$) and by Eden et al. (FOCS 2015) for triangle counting ($k=3$). Our result matches the complexities of these results. The previous result by Eden et al. hinges on a certain amortization technique that works only for triangle counting, and does not generalize for larger cliques. We obtain a general algorithm that works for any $k\geq 3$ by designing a procedure that samples each $k$-clique incident to a given set $S$ of vertices with approximately equal probability. The primary difficulty is in finding cliques incident to purely high-degree vertices, since random sampling within neighbors has a low success probability. This is achieved by an algorithm that samples uniform random high degree vertices and a careful tradeoff between estimating cliques incident purely to high-degree vertices and those that include a low-degree vertex

Classical and quantum pumping in closed systems

Pumping of charge (Q) in a closed ring geometry is not quantized even in the strict adiabatic limit. The deviation form exact quantization can be related to the Thouless conductance. We use Kubo formalism as a starting point for the calculation of both the dissipative and the adiabatic contributions to Q. As an application we bring examples for classical dissipative pumping, classical adiabatic pumping, and in particular we make an explicit calculation for quantum pumping in case of the simplest pumping device, which is a 3 site lattice model.Comment: 5 pages, 3 figures. The long published version is cond-mat/0307619. This is the short unpublished versio

Optimal query complexity for estimating the trace of a matrix

Given an implicit $n\times n$ matrix $A$ with oracle access $x^TA x$ for any $x\in \mathbb{R}^n$, we study the query complexity of randomized algorithms for estimating the trace of the matrix. This problem has many applications in quantum physics, machine learning, and pattern matching. Two metrics are commonly used for evaluating the estimators: i) variance; ii) a high probability multiplicative-approximation guarantee. Almost all the known estimators are of the form $\frac{1}{k}\sum_{i=1}^k x_i^T A x_i$ for $x_i\in \mathbb{R}^n$ being i.i.d. for some special distribution. Our main results are summarized as follows. We give an exact characterization of the minimum variance unbiased estimator in the broad class of linear nonadaptive estimators (which subsumes all the existing known estimators). We also consider the query complexity lower bounds for any (possibly nonlinear and adaptive) estimators: (1) We show that any estimator requires $\Omega(1/\epsilon)$ queries to have a guarantee of variance at most $\epsilon$. (2) We show that any estimator requires $\Omega(\frac{1}{\epsilon^2}\log \frac{1}{\delta})$ queries to achieve a $(1\pm\epsilon)$-multiplicative approximation guarantee with probability at least $1 - \delta$. Both above lower bounds are asymptotically tight. As a corollary, we also resolve a conjecture in the seminal work of Avron and Toledo (Journal of the ACM 2011) regarding the sample complexity of the Gaussian Estimator.Comment: full version of the paper in ICALP 201